Search results for "discrete [space-time]"

Refined instability estimates for some inverse problems

2022

Many inverse problems are known to be ill-posed. The ill-posedness can be manifested by an instability estimate of exponential type, first derived by Mandache [29]. In this work, based on Mandache's idea, we refine the instability estimates for two inverse problems, including the inverse inclusion problem and the inverse scattering problem. Our aim is to derive explicitly the dependence of the instability estimates on key parameters. The first result of this work is to show how the instability depends on the depth of the hidden inclusion and the conductivity of the background medium. This work can be regarded as a counterpart of the depth-dependent and conductivity-dependent stability estim…

Systematic implementation of higher order Whitney forms in methods based on discrete exterior calculus

2022

AbstractWe present a systematic way to implement higher order Whitney forms in numerical methods based on discrete exterior calculus. Given a simplicial mesh, we first refine the mesh into smaller simplices which can be used to define higher order Whitney forms. Cochains on this refined mesh can then be interpolated using higher order Whitney forms. Hence, when the refined mesh is used with methods based on discrete exterior calculus, the solution can be expressed as a higher order Whitney form. We present algorithms for the three required steps: refining the mesh, solving the coefficients of the interpolant, and evaluating the interpolant at a given point. With our algorithms, the order of…

On a numerical solution of the Maxwell equations by discrete exterior calculus

2014

The average number of Sylow subgroups of a finite group

2013

We prove that if the average Sylow number (ignoring the Sylow numbers that are one) of a finite group G is ⩽7, then G is solvable.

Characterization of strong chain geometries by their automorphism group

1992

A wide class of chain geometries is characterized by their automorphism group using properties of a distinguished involution.

The Fitting Subgroup and Some Injectors of Radical Locally Finite Groups with min-pfor Allp

2003

Abstract This work was intended as an attempt to continue the study of the class ℬ of generalised nilpotent groups started in a previous paper. We present some results concerning the Fitting subgroup and the ℬ-injectors of a radical locally finite group satisfying min-p for all p.

A Gaschütz–Lubeseder Type Theorem in a Class of Locally Finite Groups

1999

The aim of this paper is to present a Gaschutz–Lubeseder type theorem in the class cL of all radical locally finite groups satisfying min−p for all primes p. Notice that these groups are countable and co-Hopfian by [1, (5.4.8)]. In retrospect, the theory of saturated formations of finite soluble groups began with the results of Gaschutz [3] in 1963. He introduced the concept of “covering subgroup” as a generalization of Sylow and Hall subgroups. These covering subgroups have many of the properties of Sylow and Hall subgroups other than the arithmetic ones. The main idea of Gaschutz’s work was concerned with group theoretical classes having the same properties. He defined a formation F to be…

On some classes of supersoluble groups

2007

[EN] Finite groups G for which for every subgroup H and for all primes q dividing the index |G:H| there exists a subgroup K of G such that H is contained in K and |K:H|=q are called Y-groups. Groups in which subnormal subgroups permute with all Sylow subgroups are called PST-groups. In this paper a local version of the Y-property leading to a local characterisation of Y-groups, from which the classical characterisation emerges, is introduced. The relationship between PST-groups and Y-groups is also analysed.

Variational parabolic capacity

2015

We establish a variational parabolic capacity in a context of degenerate parabolic equations of $p$-Laplace type, and show that this capacity is equivalent to the nonlinear parabolic capacity. As an application, we estimate the capacities of several explicit sets.

A Complete, Exact and Efficient Implementation for Computing the Edge-Adjacency Graph of an Arrangement of Quadrics

2011

International audience; We present a complete, exact and efficient implementation to compute the edge-adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersection points and from that the edge-adjacency graph of the arrangement. Our implementation is complete in the sense that it can handle all kinds of inputs including all degenerate ones, i.e. singularities or tangential intersection points. It is exact in that it always comp…